Cutting to the Chase Solving Linear Integer Arithmetic
نویسندگان
چکیده
We describe a new algorithm for solving linear integer programming problems. The algorithm performs a DPLL style search for a feasible assignment, while using a novel cut procedure to guide the search away from the conflicting states.
منابع مشابه
A New Approach for Solving a Class of Pure Integer Linear Programming Problems
ABSTRACT A new method called variable reduction method for a classes of pure integer linear programming problems in single stage, is introduced which is better than the cutting plane method and the branch bound method. Both easy to understand and to apply, the variable reduction method can serve as an effective tool for solving integer linear programming problems while making the method accessi...
متن کاملInteger Solutions to Cutting Stock Problems
We consider two integer linear programming models for the one-dimensional cutting stock problem that include various difficulties appearing in practical real problems. Our primary goals are the minimization of the trim loss or the minimization of the number of master rolls needed to satisfy the orders. In particular, we study an approach based on the classical column-generation procedure by Gil...
متن کاملA Simplex-Based Extension of Fourier-Motzkin for Solving Linear Integer Arithmetic
This paper describes a novel decision procedure for quantifierfree linear integer arithmetic. Standard techniques usually relax the initial problem to the rational domain and then proceed either by projection (e.g. Omega-Test) or by branching/cutting methods (branch-and-bound, branch-and-cut, Gomory cuts). Our approach tries to bridge the gap between the two techniques: it interleaves an exhaus...
متن کاملInterior Point Algorithms for Integer Programming
An algorithm for solving linear programming problems can be used as a subroutine in methods for more complicated problems. Such methods usually involve solving a sequence of related linear programming problems, where the solution to one linear program is close to the solution to the next, that is, it provides a warm start for the next linear program. The branch and cut method for solving intege...
متن کاملOn the Satisfiability of Modular Arithmetic Formula
Modular arithmetic is the underlying integer computation model in conventional programming languages. In this paper, we discuss the satisfiability problem of modular arithmetic formulae over the finite ring Z2ω . Although an upper bound of 2 2 4) can be obtained by solving alternation-free Presburger arithmetic, it is easy to see that the problem is in fact NP-complete. Further, we give an effi...
متن کاملذخیره در منابع من
با ذخیره ی این منبع در منابع من، دسترسی به آن را برای استفاده های بعدی آسان تر کنید
عنوان ژورنال:
دوره شماره
صفحات -
تاریخ انتشار 2011